A BDD - based Veri cation Engine for Combinational
نویسنده
چکیده
| In this paper we discuss the development of a BDD-based veriication engine for combina-tional equivalence checking. We focus on the techniques used to obtain eecient processing of practical problem instances. These techniques include the detection and utilization of functionally equivalent signals and of isomorphic sub-circuits. Experimental results on well-known benchmarks as well as industrial designs are presented to evaluate these techniques.
منابع مشابه
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential test. Existing BDD-based symbolic algorithms for image computation are limited by memory resources in practice, while SAT-based algorithms that can obtain the image by enumerating satisfying assignments to a CNF repr...
متن کاملCombinational Logic-Level Veri cation using Boolean Expression Diagrams
Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level ve...
متن کاملVERIFUL : VERI cation using FUnctional Learning
It is well known that learning (i.e., indirect implications) based techniques perform very well in many instances of combinational circuit veri cation when the two circuits being veri ed have many corresponding internal equivalent points. We present some results on combinational circuit design veri cation using a powerful, and highly general learning technique called functional learning. Functi...
متن کاملFormal Veri cation of a PowerPC Microprocessor
This paper presents the use of formal methods in the design of a PowerPC microprocessor. The chosen methodology employs two independently developed design views, a register-transfer level speci cation for e cient system simulation and a transistorlevel implementation geared toward maximal processor performance. A BDD-based veri cation tool is used to functionally compare the two views which ess...
متن کاملData Structures for the Veri cation of Timed Automata
In this paper we suggest numerical decision diagrams a bdd based data structure for representing certain subsets of the Euclidean space namely those encountered in veri cation of timed automata Un like other representation schemes ndd s are canonical and provide for all the necessary operations needed in the veri cation and synthesis of timed automata We report some preliminary experimental res...
متن کامل